Towards Convenient Bi-Directional Grammar Formalisms
نویسنده
چکیده
P. Newmzrn IBM Pale Alto Scientific Center 1530 Page Mill Road Pale Alto, CA 94304, US/Y This paper discusses tim advantages for practical bi :, direclional grammars 6(combirfiug a lexical fbcus with the (}PEG-originated principle of immediatedominance/line.ar-precedence (I[)/1,P) rule partitioning. It. also outlines an implenlentation approach fbllowing these gafidelines. The approach is inspired by Slot Grammar, with additions including more explicit map. pings between surface and internal representations, and preferential constihJent ordering, rules.
منابع مشابه
Symmetric Slot Grammar (SSG): A Bi-directional Design for MT
Grammar formalisms combining a lexicalist orientation with an immediate-dominance/linear-precedence (ID/LP) partitioning of information have considerable potential for bi-directional use, fundamentally because the information is expressed in a modular way and thus can be applied differently in parsing and generation. This paper describes an in-process design for a bi-directional formalism of th...
متن کاملFluid Construction Grammar on Real Robots
Abstract This chapter introduces very briefly the framework and tools for lexical and grammatical processing that have been used in the evolutionary language game experiments reported in this book. This framework is called Fluid Construction Grammar (FCG) because it rests on a constructional approach to language and emphasizes flexible grammar application. Construction grammar organizes the kno...
متن کاملSimplified Bi-Directional Transformation of UML Activities into Petri Nets
Model-to-Model mapping should offer the advantage of fully operational bi-directional mapping between different models or formalisms that share some common properties. However in reality this is not easily achievable. It is acknowledged that previous work was presented where it was shown how Triple Graph Grammars are useful to achieve the mapping. UML 2 activities share some similarities with P...
متن کاملCapturing Disjunction In Lexicalization With Extensible Dependency Grammar
In spite of its potential for bidirectionality, Extensible Dependency Grammar (XDG) has so far been used almost exclusively for parsing. This paper represents one of the first steps towards an XDG-based integrated generation architecture by tackling what is arguably the most basic among generation tasks: lexicalization. Herein we present a constraint-based account of disjunction in lexicalizati...
متن کاملA Comparison of Rule-Invocation Strategies in Context-Free Chart Parsing
Currently several grammatical formalisms converge towards being declarative and towards utilizing context-free phrase-structure grammar as a backbone, e.g. LFG and PATR-II. Typically the processing of these formalisms is organized within a chart-parsing framework. The declarative character of the formalisms makes it important to decide upon an overall optimal control strategy on the part of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1990